Wire Speed Name Lookup: A GPU-based Approach

نویسندگان

  • Yi Wang
  • Yuan Zu
  • Ting Zhang
  • Kunyang Peng
  • Qunfeng Dong
  • Bin Liu
  • Wei Meng
  • Huichen Dai
  • Xin Tian
  • Zhonghu Xu
  • Hao Wu
  • Di Yang
چکیده

This paper studies the name lookup issue with longest prefix matching, which is widely used in URL filtering, content routing/switching, etc. Recently Content-Centric Networking (CCN) has been proposed as a clean slate future Internet architecture to naturally fit the contentcentric property of today’s Internet usage: instead of addressing end hosts, the Internet should operate based on the identity/name of contents. A core challenge and enabling technique in implementing CCN is exactly to perform name lookup for packet forwarding at wire speed. In CCN, routing tables can be orders of magnitude larger than current IP routing tables, and content names are much longer and more complex than IP addresses. In pursuit of conquering this challenge, we conduct an implementation-based case study on wire speed name lookup, exploiting GPU’s massive parallel processing power. Extensive experiments demonstrate that our GPU-based name lookup engine can achieve 63.52M searches per second lookup throughput on large-scale name tables containing millions of name entries with a strict constraint of no more than the telecommunication level 100μs per-packet lookup latency. Our solution can be applied to contexts beyond CCN, such as search engines, content filtering, and intrusion prevention/detection. c ⃝Prof. Qunfeng Dong ([email protected]) and Prof. Bin Liu ([email protected]), placed in alphabetic order, are the correspondence authors of the paper. Yi Wang and Yuan Zu, placed in alphabetic order, are the lead student authors of Tsinghua University and University of Science and Technology of China, respectively. This paper is supported by 863 project (2013AA013502), NSFC (61073171, 61073184), Tsinghua University Initiative Scientific Research Program(20121080068), the Specialized Research Fund for the Doctoral Program of Higher Education of China(20100002110051), the Ministry of Education (MOE) Program for New Century Excellent Talents (NCET) in University, the Science and Technological Fund of Anhui Province for Outstanding Youth (10040606Y05), by the Fundamental Research Funds for the Central Universities (WK0110000007, WK0110000019), and Jiangsu Provincial Science Foundation (BK2011360).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Approach in Radiation Therapy Treatment Planning: A Fast, GPU-Based Monte Carlo Method

Introduction: An accurate and fast radiation dose calculation is essential for successful radiation radiotherapy. The aim of this study was to implement a new graphic processing unit (GPU) based radiation therapy treatment planning for accurate and fast dose calculation in radiotherapy centers. Materials and Methods: A program was written for parallel runnin...

متن کامل

Intelligent Knowledge Based System Approach for Optimization of Design and Manufacturing Process for Wire-Electrical Discharge Machining

Wire electrical discharge machining (WEDM) is a method to cut conductive materials with a thin electrode that follows a programmed path. The electrode is a thin wire. Typical diameters range from .004" - .012" (.10mm - .30mm) although smaller and larger diameters are available. WEDM is a thermal machining process capable of accurately machining parts with varying hardness or complex shapes. WED...

متن کامل

Intelligent Knowledge Based System Approach for Optimization of Design and Manufacturing Process for Wire-Electrical Discharge Machining

Wire electrical discharge machining (WEDM) is a method to cut conductive materials with a thin electrode that follows a programmed path. The electrode is a thin wire. Typical diameters range from .004" - .012" (.10mm - .30mm) although smaller and larger diameters are available. WEDM is a thermal machining process capable of accurately machining parts with varying hardness or complex shapes. WED...

متن کامل

GPU-based Line Probing Techniques for Mikami Routing Algorithm

Graphic processing unit (GPU), which contains hundreds of processing cores, is becoming a popular device for high performance computation in multi-core era. With strictly computation regularity characteristic, specific algorithms are key challenges for performance speed-up. In this paper, we propose a parallel CUDA-Mikami routing algorithm on NVIDIA’s GPU. A 32-bit routing grid encoding is prop...

متن کامل

A scalable IPv 6 route lookup scheme via dynamic variable - stride bitmap compression and path compression q

The significantly increased address length of IPv6 (128-bit) provides an endless pool of address space. However, it also poses a great challenge on wire-speed route lookup for high-end routing devices, because of the explosive growth of both lookup latency and storage requirement. As a result, even today’s most efficient IPv4 route lookup schemes can hardly be competent for IPv6. In this paper,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013